Separating Overlapped Fingerprints Using Constrained Relaxation Labeling

نویسندگان

  • Yuan Shi
  • Jianjiang Feng
  • Jie Zhou
چکیده

Overlapped fingerprints are frequently encountered in latent fingerprints lifted from crime scenes. It is necessary to separate such overlapped fingerprints into component fingerprints so that existing fingerprint matchers can recognize them. The most crucial step in separating overlapped fingerprints is the separation of mixed orientation fields into component orientation fields. In this paper, a constrained relaxation labeling algorithm is proposed to perform the orientation field separation task. Experimental results on both real and simulated overlapped fingerprints show that the proposed algorithm outperforms the state-of-the-art algorithm in both accuracy and efficiency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separation of Overlapped Fingerprints for Forensic Applications

Normally, fingerprint images contain a single fingerprint or a set of non overlapped fingerprints. There may be situations where overlapped fingerprint can be obtained. It can be frequently encountered in the latent fingerprint lifted from crime scenes. It is essential to separate those overlapped fingerprint into its component fingerprints. The challenging work in separating overlapped fingerp...

متن کامل

Improved Algorithm for Separating Latent Overlapped Fingerprints

Latent Overlapped fingerprints are frequently encountered in latent fingerprints lifted from crime scenes. Overlapping occurs when the same location of an object is touched by one or more fingers several times. It is necessary to separate such latent overlapped fingerprints into component fingerprints so that existing fingerprint matchers can recognize them. In fact, fingerprint examiners usual...

متن کامل

Relaxation labeling using Lagrange-Hopfield method

A novel relaxation labeling (RL) algorithm is proposed. RL is posed as a constrained optimization problem and the solution is found by using the Lagrangian multiplier method and a technique used in the graded Hoppeld neural network. In terms of the optimized objective value, the algorithm performs almost as well as simulated annealing, as shown by the experimental results. Also, the resulting a...

متن کامل

Relaxation labeling using augmented lagrange-hopfield method

A novel relaxation labeling (RL) method is presented based on Augmented Lagrangian multipliers and the graded Hoppeld neural network (ALH). In this method, an RL problem is converted into a constrained optimization problem and solved by using the augmented Lagrangian and Hoppeld techniques. The ALH method yields results comparable to the best of the existing RL algorithms in terms of the optimi...

متن کامل

A semidefinite relaxation scheme for quadratically constrained

  Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011